Secure multiparty computations without computers
نویسندگان
چکیده
منابع مشابه
Secure Multiparty Computations Without Computers
Many simple calculations can be done easier without computers than by using them. We show that the same holds for secure multiparty computations if the function to be computed is simple enough. Our starting point is an observation of Bert den Boer: a multiparty computation of a logical ANDgate can be performed by ve simple playing cards. We show that by using a reasonable amount of cards many u...
متن کاملAuditing of Secure Multiparty Computations
Secure multiparty computations allow independent parties to collectively analyze data without compromising their input’s privacy. This data secrecy is guaranteed in some security model: in the passive model an adversary can only look at data visible to it, while in the active model adversaries can actively interfere in the computations. So from a security standpoint the active model is preferab...
متن کاملSecure multiparty computation without one-way functions
We describe protocols for secure computation of the sum, product, and some other functions of two or more elements of an arbitrary constructible ring, without using any one-way functions. One of the new inputs that we offer here is that, in contrast with other proposals, we conceal intermediate results of a computation. For example, when we compute the sum of k numbers, only the final result is...
متن کاملMultiparty Computations Information-Theoretically Secure Against an Adaptive Adversary
In this thesis we study a problem of doing Verifiable Secret Sharing (VSS) and Multiparty Computations (MPC) in a model where private channels between the players and a broadcast channel is available. The adversary is active, adaptive and has an unbounded computing power. The thesis is based on two papers [CDD00, CDD99]. In [CDD00] we assume that the adversary can corrupt any set from a given a...
متن کاملEfficient Multiparty Computations Secure Against an Adaptive Adversary
We consider veriiable secret sharing (VSS) and multiparty computation (MPC) in the secure-channels model, where a broadcast channel is given and a non-zero error probability is allowed. In this model Rabin and Ben-Or proposed VSS and MPC protocols secure against an adversary that can corrupt any minority of the players. In this paper, we rst observe that a subprotocol of theirs, known as weak s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00107-2